Minimal-Variance Distributed Deadline Scheduling in a Stationary Environment
نویسندگان
چکیده
منابع مشابه
Workflow Scheduling Based on Deadline Constraints in Cloud Environment
loud computing is providing an environment for scientific workflows where large-scale and complex scientific analysis can be scheduled onto a heterogeneous collection of computational and storage resources. A scientific workflow is described as a paradigm, which is used to describe a set of structured activities and scientific computations. Scientific workflow scheduling has become one of the m...
متن کاملGeneration scheduling in a competitive environment
Electric power restructuring offers a major change to the vertically integrated monopoly. The change manifests the main part of engineers’ efforts to reshape the three components of today’s vertically integrated monopoly: generation, distribution and transmission. In a restructured environment, the main tasks of these three components will remain the same as before, however, to comply with ...
متن کاملFibre-Ribbon Pipeline Ring Network with Distributed Global Deadline Scheduling
This paper introduces a novel, fair medium access protocol for a pipelined optical ring network. The protocol provides global optimisation of deadline constraints on a packet basis. Requests for sending packets are sent by the nodes in the network to the current master node. The master uses deadline information in the requests to determine which request is most urgent. Arbitration is done in tw...
متن کاملState-Dependent Deadline Scheduling
This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how to choose target deadlines for jobs from their time-varying deadlines so that the system can meet its requirements with a high probability. In the clairvoyant case, the deadline of every job is given by a known functi...
متن کاملAggressive Online Deadline Scheduling
This paper is concerned with online algorithms for scheduling jobs with deadlines on a single processor. It has been known for long that unless the system is underloaded, no online scheduling algorithm can be 1-competitive, i.e., matching the performance of the optimal offline algorithm. Nevertheless, recent work has revealed that some online algorithms using a moderately faster processor (or e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2019
ISSN: 0163-5999
DOI: 10.1145/3308897.3308925